A Data Layout Strategy for Parallel Web Servers

In this paper a new mechanism for mapping data items onto the storage devices of a parallel web server is presented. The method is based on careful observation of the eeects that limit the performance of parallel web servers, and by studying the access patterns for these servers. On the basis of these observations, a graph theoretic concept is developed , and partitioning algorithms are used to allocate the data items. The resulting strategy is investigated and compared to other methods using experiments based on typical access patterns from web servers that are in daily use.